package code1.dp;

/**
 * 原题链接：https://leetcode.cn/problems/maximum-length-of-repeated-subarray/description/
 */
public class P718 {

    //最长连续公共子序列
    public int findLength(int[] nums1, int[] nums2) {
        int[][] dp=new int[nums1.length+1][nums2.length+1];
        int result=0;
        for(int i=1;i<=nums1.length;i++){
            for(int j=1;j<=nums2.length;j++){
                if(nums1[i-1]==nums2[j-1]){
                    dp[i][j]=dp[i-1][j-1]+1;
                }else{
                    dp[i][j]=0;
                }
                result=Math.max(dp[i][j],result);
            }
        }
        return result;
    }
}
